General relations between partially ordered multisets and their chains and antichains
نویسندگان
چکیده
In this paper we begin with the basics of multisets and their operations introduced in [5, 22] and define a multiset relation, an equivalence multiset relation and explore some of their basic properties. We also define a partially ordered multiset as a multiset relation being reflexive, antisymmetric and transitive, chains and antichains of a partially ordered multiset, and extend Dilworth’s Theorems for partially ordered sets in the context of partially ordered multisets. AMS subject classifications: 00A05, 03E70, 03E99, 06A99
منابع مشابه
General definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملAn algorithmic approach to maximal unions of chains in a partially ordered set
We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a nite partially ordered set P for every positive integer k. As a consequence, we obtain an algorithmic proof of Greene's Duality Theorem on the relations between the cardinalities of maximal unions of chains and antichains in a nite poset. Mathematics Subject Classi cations (2000). 05A17, 06A07, 68Q25,...
متن کاملA classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کاملAntichains of Multisets
The problem of enumeration of m-antichains of k-bounded multisets on an n-set is considered. A formula for calculating the cardinality of the corresponding family in terms of the graph theory was obtained. A more general case of multiantichains is also considered. As an illustration the corresponding explicit formulas are given for the case when 1 ≤ m ≤ 4, k ≥ 1 and n ≥ 0.
متن کاملLinear Orders Realized by C.E. Equivalence Relations
Let E be a computably enumerable (c.e.) equivalence relation on the set ω of natural numbers. We say that the quotient set ω/E (or equivalently, the relation E) realizes a linearly ordered set L if there exists a c.e. relation E respecting E such that the induced structure (ω/E;E) is isomorphic to L. Thus, one can consider the class of all linearly ordered sets that are realized by ω/E; formall...
متن کامل